Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries
Authors
Abstract:
In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers under demand uncertainty. A new deterministic mixed-integer linear programming (MILP) model is first presented, and then a two-stage stochastic model is proposed. The aim of this model is to meet depot requirements at the minimum total cost including pumping and stoppages costs. The efficiency and utility of the proposed model is shown by two numerical examples, which one of them uses the industrial and real data.
similar resources
An Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline
In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...
full textA Reconfigurable Computing Multiple Processor Framework with Hybrid Pipeline Scheduling
This paper presents a framework for a reconfigurable computing system, consisting of cohesive hardware and software architectures. The framework allows customization of the hardware and software to fit a class of applications, while narrowing the design space to a manageable set of design parameters. The framework features a novel hybrid static and dynamic pipeline scheduling technique, which d...
full textScheduling Sequential Processes in Tree Networks
A b s t r a c t – In this paper we focus on the problem of scheduling time-critical data flow over a measuring tree network. We assume that data are operated in discrete time and their arrival and deadline processes are arbitrary. Our goal is to determine a policy which transmits data with minimum extension time at every node (every link) in a tree network. The models existing in the literature...
full textSome Cache Optimization with Enhanced Pipeline Scheduling
Reducing the data cache stalls is getting more important as the gap between the CPU speed and the memory speed continues to grow. Many compiler-based techniques including prefetches have been proposed to mitigate the problem for numerical loops, but they are not very applicable to nonnumerical integer loops. One simple idea applicable even to those loops is separating cache-missing loads and th...
full textDetailed MATE-CLEVER Pipeline for GoNL
For deletion discovery, we ran the discovery part of MATE-CLEVER [3], with minor modifications that account for volatilities among library protocols. MATE-CLEVER is an integrated approach. Its major purpose in the frame of the project is to discover deletions of size 30–100 bp (sometimes termed the ”twilight zone of NGS indels”). It incorporates CLEVER [2], as an internal segment size based app...
full textProcess pipeline scheduling
Two processes, p and q, may be scheduled in pipeline when q may start when p starts, and q may process data items from p, one-by-one, without waiting for p to write the complete set of data items. This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. The paper first details a workflow model that captures the characteristics of the application ...
full textMy Resources
Journal title
volume 30 issue 12
pages 1870- 1878
publication date 2017-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023